Numerical methods for solving moment equations in kinetic theory of neuronal network dynamics
نویسندگان
چکیده
Recently developed kinetic theory and related closures for neuronal network dynamics have been demonstrated to be a powerful theoretical framework for investigating coarse-grained dynamical properties of neuronal networks. The moment equations arising from the kinetic theory are a system of (1 + 1)-dimensional nonlinear partial differential equations (PDE) on a bounded domain with nonlinear boundary conditions. The PDEs themselves are self-consistently specified by parameters which are functions of the boundary values of the solution. The moment equations can be stiff in space and time. Numerical methods are presented here for efficiently and accurately solving these moment equations. The essential ingredients in our numerical methods include: (i) the system is discretized in time with an implicit Euler method within a spectral deferred correction framework, therefore, the PDEs of the kinetic theory are reduced to a sequence, in time, of boundary value problems (BVPs) with nonlinear boundary conditions; (ii) a set of auxiliary parameters is introduced to recast the original BVP with nonlinear boundary conditions as BVPs with linear boundary conditions – with additional algebraic constraints on the auxiliary parameters; (iii) a careful combination of two Newton’s iterates for the nonlinear BVP with linear boundary condition, interlaced with a Newton’s iterate for solving the associated algebraic constraints is constructed to achieve quadratic convergence for obtaining the solutions with self-consistent parameters. It is shown that a simple fixed-point iteration can only achieve a linear convergence for the self-consistent parameters. The practicability and efficiency of our numerical methods for solving the moment equations of the kinetic theory are illustrated with numerical examples. It is further demonstrated that the moment equations derived from the kinetic theory of neuronal network dynamics can very well capture the coarsegrained dynamical properties of integrate-and-fire neuronal networks. 2006 Elsevier Inc. All rights reserved.
منابع مشابه
Numerical Methods for Solving Kinetic Equations of Neuronal Net- work Dynamics
Recently developed kinetic theory for neuronal network dynamics has been demonstrated to be a powerful theoretical framework for investigating coarse-grained dynamical properties of neuronal networks. The kinetic equations are a system of (1+1)dimensional nonlinear partial differential equations (PDE) on a bounded domain with the following features: (i) the boundary conditions are nonlinear and...
متن کاملKinetic theory for neuronal networks with fast and slow excitatory conductances driven by the same spike train.
We present a kinetic theory for all-to-all coupled networks of identical, linear, integrate-and-fire, excitatory point neurons in which a fast and a slow excitatory conductance are driven by the same spike train in the presence of synaptic failure. The maximal-entropy principle guides us in deriving a set of three (1+1) -dimensional kinetic moment equations from a Boltzmann-like equation descri...
متن کاملMaximum-entropy closures for kinetic theories of neuronal network dynamics.
We analyze (1 + 1)D kinetic equations for neuronal network dynamics, which are derived via an intuitive closure from a Boltzmann-like equation governing the evolution of a one-particle (i.e., one-neuron) probability density function. We demonstrate that this intuitive closure is a generalization of moment closures based on the maximum-entropy principle. By invoking maximum-entropy closures, we ...
متن کاملAn effective kinetic representation of fluctuation-driven neuronal networks with application to simple and complex cells in visual cortex.
A coarse-grained representation of neuronal network dynamics is developed in terms of kinetic equations, which are derived by a moment closure, directly from the original large-scale integrate-and-fire (I&F) network. This powerful kinetic theory captures the full dynamic range of neuronal networks, from the mean-driven limit (a limit such as the number of neurons N --> infinity, in which the fl...
متن کاملModified Linear Approximation for Assessment of Rigid Block Dynamics
This study proposes a new linear approximation for solving the dynamic response equations of a rocking rigid block. Linearization assumptions which have already been used by Hounser and other researchers cannot be valid for all rocking blocks with various slenderness ratios and dimensions; hence, developing new methods which can result in better approximation of governing equations while keepin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Physics
دوره 221 شماره
صفحات -
تاریخ انتشار 2007